A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
نویسندگان
چکیده
We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.
منابع مشابه
Investigations on push-relabel based algorithms for the maximum transversal problem
We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easy-to-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of real-world instances, we compa...
متن کاملPush-relabel based algorithms for the maximum transversal problem
We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easyto-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of realworld instances, we compare...
متن کاملCompetitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation, stereo vision, multi-view reconstruction and surface fitting. While several min-cut/m...
متن کاملSimplifications and speedups of the pseudoflow algorithm
The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum in [13]. The complexity of the algorithm was shown in [13] to be O(nm log n). In [5] Chandran and Hochbaum demonstrated that the pseudoflow algorithm is very efficient in practice, and that the highest label version of the algorithm tends to perform best. Here we improve the running time of th...
متن کاملPractical and theoretical improvements for bipartite matching using the pseudoflow algorithm
We show that the pseudoflow algorithm for maximum flow is particularly efficient for the bipartite matching problem both in theory and in practice. We develop several implementations of the pseudoflow algorithm for bipartite matching, and compare them over a wide set of benchmark instances to state-ofthe-art implementations of push-relabel and augmenting path algorithms that are specifically de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 57 شماره
صفحات -
تاریخ انتشار 2009